package OrderMap;

/**
 * @author Liaorun
 */
public class AbstractBinarySearchTree {

    protected Node root;

    protected Node insert(int element) {
        return new Node(element);
    }

    protected Node search(int element) {
        return null;
    }

    protected Node delete(Node deleteNode) {
        return null;
    }


    public class Node {
        public int value;
        public Node left;
        public Node right;
        public Node parent;

        public Node(int value) {
            this.value = value;
        }
    }
}
